#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 2e5 + 10;

int n, q;
ll x[N], w[N], ans[N], totL, totR, mxL, mxR, pos;
pair < ll, int > t[N];

void calc(int id, ll L, ll R) { ans[id] += L; ans[id + 1] += R; }

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	n = in, q = in; rep(i, 1, n) x[i] = lin;
	rep(i, 2, n) t[i - 1].fi = x[i] - x[i - 1], t[i - 1].se = i - 1;
	sort(t + 1, t + n); int cur = 1;
	rep(i, 1, q) {
		w[i] = lin; pos += w[i];
		ll lst = totL + totR;
		if(w[i] > 0) {
			if(pos > mxL) {
				ll tot = lst + pos - mxL;
				while(cur < n && t[cur].fi <= tot) calc(t[cur].se, totL + t[cur].fi - lst, totR), cur++;
				totL += pos - mxL; mxL = pos; 
			}
		} else {
			pos = -pos;
			if(pos > mxR) {
				ll tot = lst + pos - mxR; 
				while(cur < n && t[cur].fi <= tot) calc(t[cur].se, totL, totR + t[cur].fi - lst), cur++;
				totR += pos - mxR; mxR = pos; 
			} pos = -pos;
		} 
	}
	while(cur < n) calc(t[cur].se, totL, totR), cur++;
	ans[1] += totR; ans[n] += totL;
	rep(i, 1, n) printf("%lld\n", ans[i]);
	return 0;
}
